package com.ljy.my_study.lintcode.用栈实现队列;

import java.util.Stack;

/**
 * @author James
 * @date 2018年9月28日
 */
public class StackQueue {
	Stack<Integer> stack1 = new Stack<Integer>();
	Stack<Integer> stack2 = new Stack<Integer>();

	public void push(int node) {
		stack1.push(node);
	}

	public int pop() {
		if (stack2.empty()) {
			while (!stack1.empty())
				stack2.push(stack1.pop());
		}
		return stack2.pop();
	}
	public int top() {
		if (stack2.empty()) {
			while (!stack1.empty())
				stack2.push(stack1.pop());
		}
		return stack2.peek();
	}
}
